搜索资源列表
FindaMininalSpanningTree
- 输入含权图的邻接矩阵，输出最小生成树的邻接矩阵 1、本实验用到的理论知识 Prim算法 算法设计 设图G =（V，E），其生成树的顶点集合为U。 ①、把v0放入U。 ②、在所有u∈U，v∈V-U的边(u，v)∈E中找一条最小权值的边，加入生成树。 ③、把②找到的边的v加入U集合。如果U集合已有n个元素，则结束，否则继续执行②。-Enter the right graph with adjacency matrix, the output of the ad
tree
- 求最小生成树的实验代码和结果，用到Prim算法-Seeking the minimum spanning tree of the experimental code and results, used Prim algorithm
Graph
- 图的大部分实现 图的深度优先周游 图的广度优先周游 由队列方式实现的拓扑排序 由深度优先搜索方式实现的拓扑排序 单源最短路径(Dijkstra算法) 每对顶点之间的最短路径(Floyd算法) 最小支撑树(Prim算法) 最小支撑树(Kruskal算法)-Figure most of the implementation diagram of the depth-first breadth-first tour travel map be achieved by the topological s
Prim
- 应用Prim算法构造最小生成树，是数据结构的节本算法-Application of Prim minimum spanning tree algorithm is constructed, the data section of the structure of the algorithm
prim
- Prim’s Minimum Spanning Tree Algorithm
33u
- 最小生成树的prim算法。。用邻接矩阵实现-Prim algorithm for minimum spanning tree. . With the adjacency matrix to achieve
zhonghuan
- 课程设计题目∶ 设计程序完成如下功能： 对给定的网和起点，实现求解最小生成树的PRIM算法，并给出求解过程的动态演示。-Curriculum topics: design process is complete the following functions: For a given network and the starting point to achieve the PRIM algorithm for solving minimum spanning tree, and giv
PrimAlgorithm
- 最小生成树prim算法，Dandn文件给出了输入参数的名称及格式即在调用prim前先输入邻接矩阵D和节点个数n输入prim得到两行的矩阵T,将上下两行数字对应的节点相连即可-Prim algorithm for minimum spanning tree, Dandn document gives the name and format of the input parameters that is called prim before Input adjacency matrix D and
Primukas.java.tar
- In computer science, Prim s algorithm is an algorithm that finds a minimum spanning tree for a connected weighted undirected graph.
Prim1
- 本程序用C语言实现了Prim算法求解最小生成树问题-The program uses C language to implement the Prim algorithm for minimum spanning tree problem
Prim
- 普利姆算法的C++实例演示。用于求无向网的最小代价生成树-Pliem algorithm C++ instance of the presentation. Undirected network for minimum cost Spanning Tree ... ... ... ...
juzhen
- 数据结构中关于图的应用，涉及到遍历，查询，Ｐｒｉｍ算法等-Data structure on the Charts, involves traversal, query, Prim algorithm
pu
- 对右边的无向带权图，按普里姆算法求其最小生成树-On the right side of undirected weighted graph, by Prim algorithm to solve the minimum spanning tree
prim2
- prim 算法, 能实现效果 ,有需要 的下 -prim algorithm, can achieve results, there is a need for the next
Primsuanfa
- 用prim算法求带权图的最小生成树，最小生成树的边集合存在mst数组中-With prim algorithm for getting the right plan with the minimum spanning tree, minimum spanning tree of the edge set of the array there mst
min_tree
- 从conf.txt文件读取无向图矩阵 PRIM算法分步实现最小生成树-File read from conf.txt PRIM algorithm for undirected graph matrix step by step to achieve the minimum spanning tree
prim
- 基于最小生成树定理实现图最小生成树的prim算法-Implementation plan based on the theorem of minimum spanning tree minimum spanning tree algorithm prim
dsft
- 对于如图8.30所示的无向带权图G，采用普里姆算法输出从顶点0出发的最小生成树。-As shown in Figure 8.30 for the undirected weighted graph G, using Prim algorithm output starting from the vertex 0 the minimum spanning tree.
MST
- Two algorithm template(Kruskal Algorithm and Prim Algorithm) to help you get a Minimum Spanning Tr-Two algorithm template(Kruskal Algorithm and Prim Algorithm) to help you get a Minimum Spanning Tree
Minimum-spanning-tree
- 网的邻接矩阵存储（数组表示）、简单输出，最小生成树，采用Prim算法实现最小生成树。-Network adjacency matrix storage (array representation), a simple output, minimum spanning tree, minimum spanning tree using Prim algorithm.